Algorithms for multidimensional spectral factorization and sum of squares
نویسندگان
چکیده
منابع مشابه
Transformations and algorithms for least sum of squares hypersphere fitting
A problem from shape fitting is finding the sphere which has the least sum of squares fit to a set of points. Most current algorithms for this use an iterative process, with randomized restarting. We present, instead, two geometric transformations, and algorithms derived using them, which present alternate methods of solving the problem. We discuss running of these algorithms in three dimension...
متن کاملAlgorithms for Computing Exact Sum of Squares Decompositions
Research Context. Certification and validation of computational results is a major issue for modern sciences raising challenging problems at the interplay of mathematics and computational aspects of computer science. One can emphasize in this context several applications arising in the design of modern cyber-physical systems with a crucial need of exact certification. In particular, one tries t...
متن کاملAlgorithms for Computing Exact Sum of Squares Decompositions
Research Context. Certification and validation of computational results is a major issue for modern sciences raising challenging problems at the interplay of mathematics and computational aspects of computer science. One can emphasize in this context several applications arising in the design of modern cyber-physical systems with a crucial need of exact certification. In particular, one tries t...
متن کاملApproximation of the joint spectral radius using sum of squares
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach is based on a search for an SOS polynomial that proves simultaneous contractibility of a finite set of matrices. We provide a bound on the quality of the approximation that unifies several earlier results and is indepe...
متن کاملSum-of-squares proofs and the quest toward optimal algorithms
In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly suggest that this tailoring is not necessary and that a single efficient algorithm could achieve best possible guarantees for a wide range of different problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.06.003